Amir M. Ben-Amram: search on Z-Library

The world's largest scientific articles store. 70,000,000+ articles for free.

Don't use scam websites

1

Computational complexity via programming languages: constant factors do matter

Amir M. Ben-Amram, Neil D. Jones

Journal:

Acta Informatica

Year:

2000

Language:

english

File:

PDF, 224 KB

english, 2000

2

On pointers versus addresses

Ben-Amram, Amir M., Galil, Zvi

Journal:

Journal of the ACM

Year:

1992

Language:

english

File:

PDF, 2.19 MB

english, 1992

3

What is a “pointer machine”?

Ben-Amram, Amir M.

Journal:

ACM SIGACT News

Year:

1995

Language:

english

File:

PDF, 527 KB

english, 1995

4

Topological Lower Bounds on Algebraic Random Access Machines

Ben-Amram, Amir M., Galil, Zvi

Journal:

SIAM Journal on Computing

Year:

2001

Language:

english

File:

PDF, 368 KB

english, 2001

5

Unit-cost pointers versus logarithmic-cost addresses

Amir M. Ben-Amram

Journal:

Theoretical Computer Science

Year:

1994

Language:

english

File:

PDF, 607 KB

english, 1994

6

The Church-Turing thesis and its look-alikes

Ben-Amram, Amir M.

Journal:

ACM SIGACT News

Year:

2005

Language:

english

File:

PDF, 438 KB

english, 2005

7

[ACM Press the 28th ACM SIGPLAN-SIGACT symposium - London, United Kingdom (2001..-..)] Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '01 - The size-change principle for program termination

Lee, Chin Soon, Jones, Neil D., Ben-Amram, Amir M.

Year:

2001

File:

PDF, 1.20 MB

2001

8

On the Termination of Integer Loops

Ben-Amram, Amir M., Genaim, Samir, Masud, Abu Naser

Journal:

ACM Transactions on Programming Languages and Systems

Year:

2012

Language:

english

File:

PDF, 212 KB

english, 2012

9

[ACM Press the 40th annual ACM SIGPLAN-SIGACT symposium - Rome, Italy (2013.01.23-2013.01.25)] Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '13 - On the linear ranking problem for integer linear-constraint loops

Ben-Amram, Amir M., Genaim, Samir

Year:

2013

Language:

english

File:

PDF, 736 KB

english, 2013

10

[ACM Press the thirty-first annual ACM symposium - Atlanta, Georgia, United States (1999.05.01-1999.05.04)] Proceedings of the thirty-first annual ACM symposium on Theory of computing - STOC '99 - Worst-case and amortised optimality in union-find (extended abstract)

Alstrup, Stephen, Ben-Amram, Amir M., Rauhe, Theis

Year:

1999

Language:

english

File:

PDF, 620 KB

english, 1999

11

A complexity tradeoff in ranking-function termination proofs

Amir M. Ben-Amram

Journal:

Acta Informatica

Year:

2009

Language:

english

File:

PDF, 325 KB

english, 2009

12

ON THE EDGE OF DECIDABILITY IN COMPLEXITY ANALYSIS OF LOOP PROGRAMS

BEN-AMRAM, AMIR M., KRISTIANSEN, LARS

Journal:

International Journal of Foundations of Computer Science

Year:

2012

Language:

english

File:

PDF, 246 KB

english, 2012

13

Size-change termination with difference constraints

Ben-Amram, Amir M.

Journal:

ACM Transactions on Programming Languages and Systems

Year:

2008

Language:

english

File:

PDF, 243 KB

english, 2008

14

Tighter constant-factor time hierarchies

Amir M. Ben-Amram

Journal:

Information Processing Letters

Year:

2003

Language:

english

File:

PDF, 89 KB

english, 2003

15

Corrigendum to “A simple and efficient Union–Find–Delete algorithm” [Theoret. Comput. Sci. 412 (4–5) 487–492]

Amir M. Ben-Amram, Simon Yoffe

Journal:

Theoretical Computer Science

Year:

2012

File:

PDF, 119 KB

2012

16

Program termination analysis in polynomial time

Ben-Amram, Amir M., Lee, Chin Soon

Journal:

ACM Transactions on Programming Languages and Systems

Year:

2007

Language:

english

File:

PDF, 380 KB

english, 2007

17

Ranking Functions for Linear-Constraint Loops

Ben-Amram, Amir M., Genaim, Samir

Journal:

Journal of the ACM

Year:

2014

Language:

english

File:

PDF, 588 KB

english, 2014

18

Backing up in singly linked lists

Ben-Amram, Amir M., Petersen, Holger

Journal:

Journal of the ACM

Year:

2006

Language:

english

File:

PDF, 202 KB

english, 2006

19

[ACM Press the thirty-first annual ACM symposium - Atlanta, Georgia, United States (1999.05.01-1999.05.04)] Proceedings of the thirty-first annual ACM symposium on Theory of computing - STOC '99 - Backing up in singly linked lists

Ben-Amram, Amir M., Petersen, Holger

Year:

1999

Language:

english

File:

PDF, 590 KB

english, 1999

20

A simple and efficient Union–Find–Delete algorithm

Amir Ben-Amram, Simon Yoffe

Journal:

Theoretical Computer Science

Year:

2011

Language:

english

File:

PDF, 202 KB

english, 2011

21

When Can We Sort ino(n log n) Time?

Amir M. Ben-Amram, Zvi Galil

Journal:

Journal of Computer and System Sciences

Year:

1997

Language:

english

File:

PDF, 2.29 MB

english, 1997

22

SAT-based termination analysis using monotonicity constraints over the integers

CODISH, MICHAEL, GONOPOLSKIY, IGOR, BEN-AMRAM, AMIR M., FUHS, CARSTEN, GIESL, JÜRGEN

Journal:

Theory and Practice of Logic Programming

Year:

2011

Language:

english

File:

PDF, 189 KB

english, 2011

23

A complexity-theoretic proof of a Recursion-Theoretic Theorem

Ben-Amram, Amir M.

Journal:

ACM SIGACT News

Year:

2004

Language:

english

File:

PDF, 57 KB

english, 2004

To build up a library is to create a life. It’s never just a random collection of books.

— Carlos María Domínguez

Official channel

Z-Library Desktop Launcher

Z-Library Since 2009 support@z-lib.do

EnglishРусскийEspañolItalianoελληνικάاللغة العربيةBahasa IndonesiaBahasa Malaysiaहिन्दीDeutschFrançaisPortuguêsУкраїнськаPolski中文繁體中文日本語Tiếng ViệtAzərbaycan DiliՀայոց լեզուภาษาไทยTürk Diliქართველიবাংলাپښتوతెలుగుاردو한국어SrpskiБългарски